var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:(NCWN|Noncoherent)&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:(NCWN|Noncoherent)&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:(NCWN|Noncoherent)&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2020\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n J. Sebastian; and S. N. Diggavi.\n\n\n \n \n \n \n Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 66(7): 4431-4448. July 2020.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{9023963,\n abstract = {We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.},\n author = {J. {Sebastian} and S. N. {Diggavi}},\n doi = {10.1109/TIT.2020.2978183},\n issn = {1557-9654},\n journal = {IEEE Transactions on Information Theory},\n keywords = {MIMO communication;MISO communication;SIMO communication;transmitting antennas;generalized degrees freedom;noncoherent MIMO channel;asymmetric link strengths;block-fading noncoherent multiple input multiple output channels;asymmetric distributions;optimal signaling structure;asymmetric MIMO channel;single input multiple output channel;asymmetric case;SIMO channel;arbitrary link strengths;multiple input single output channel;direct links;cross links;gDoF gain;degrees of freedom optimal;MxM MIMO channel;MIMO communication;Signal to noise ratio;Fading channels;Transmitting antennas;Coherence;MISO communication;Degrees of freedom (DoF);multiple antennas;time-varying channels;noncoherent communication},\n month = {July},\n number = {7},\n pages = {4431-4448},\n tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},\n title = {Generalized Degrees Freedom of Noncoherent MIMO Channels With Asymmetric Link Strengths},\n type = {2},\n volume = {66},\n year = {2020}\n}\n\n
\n
\n\n\n
\n We study the generalized degrees of freedom (gDoF) of block-fading noncoherent multiple input multiple output (MIMO) channels with asymmetric distributions of link strengths and a coherence time of T symbol durations. We derive the optimal signaling structure for communication for the asymmetric MIMO channel, which is distinct from that for the MIMO channel with independent and identically distributed (i.i.d.) links. We extend the existing results for the single input multiple output (SIMO) channel with i.i.d. links to the asymmetric case, proving that selecting the statistically best antenna is gDoFoptimal. Using the gDoF result for the SIMO channel, we prove that for T = 1, the gDoF is zero for MIMO channels with arbitrary link strengths. We show that selecting the statistically best antenna is gDoF-optimal for the multiple input single output (MISO) channel. We also derive the gDoF for the 2 x 2 MIMO channel with different exponents in the direct and cross links. In this setting, we show that it is always necessary to use both the antennas to achieve the gDoF, in contrast to the results for the 2 x 2 MIMO channel with i.i.d. links. We show that having weaker crosslinks, gives gDoF gain compared to the case with i.i.d. links. For the noncoherent MIMO channel with i.i.d. links, the traditional method of training each transmit antenna independently is degrees of freedom (DoF) optimal, whereas we observe that for the asymmetric 2 x 2 MIMO channel, the traditional training is not gDoF-optimal. We extend this observation to a larger MxM MIMO channel by demonstrating a strategy that can achieve larger gDoF than a traditional trainingbased method.\n
\n\n\n
\n\n\n
\n \n\n \n \n J. Sebastian; and S. Diggavi.\n\n\n \n \n \n \n \n Generalized Degrees of Freedom of Noncoherent Diamond Networks.\n \n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 66(8): 5228-5260. Aug 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Generalized arxiv\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{9046857,\n abstract = {We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.},\n author = {J. {Sebastian} and S. {Diggavi}},\n doi = {10.1109/TIT.2020.2983169},\n issn = {1557-9654},\n journal = {IEEE Transactions on Information Theory},\n keywords = {channel capacity;fading channels;learning (artificial intelligence);MIMO communication;optimisation;quantisation (signal);radio receivers;radio transmitters;relay networks (telecommunication);telecommunication computing;noncoherent point-to-point MIMO channel;noncoherent point-to-point multiple-input-multiple-output channel;TS-QMF;bound signaling solution;bound optimization problem;channel capacity;Hochwald;Marzetta;block-fading model;asymmetric distribution;noncoherent diamond wireless network;generalized degrees of freedom;noncoherent diamond network;gDoF-optimal scheme;train-scale quantize-map-forward;channel state information;Signal to noise ratio;Relays;Diamond;MIMO communication;Upper bound;Fading channels;Wireless networks;Noncoherent communication;degrees of freedom (DoF);relay channels;diamond network;time-varying channels},\n month = {Aug},\n number = {8},\n pages = {5228-5260},\n tags = {journal,IT,ANIT,WiNetnew,NCWN,WNIF},\n title = {Generalized Degrees of Freedom of Noncoherent Diamond Networks},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1802.02667},\n volume = {66},\n year = {2020}\n}\n\n
\n
\n\n\n
\n We study the generalized degrees of freedom (gDoF) of the noncoherent diamond (parallel relay) wireless network with asymmetric distributions of link strengths. We use the noncoherent block-fading model introduced by Marzetta and Hochwald, where no channel state information is available at the transmitters or at the receivers and the channels remain constant for a coherence time of T symbol durations. We first derive an upper bound for the capacity of this channel and then derive the optimal structure for the solution of the upper bound optimization problem. Using the optimal structure, we solve the upper bound optimization problem in terms of its gDoF. Using insights from our upper bound signaling solution, we devise an achievability strategy based on a novel scheme that we call train-scale quantize-map-forward (TS-QMF). This scheme uses training in the links from the source to the relays, scaling and quantizing at the relays combined with nontraining-based schemes. We show the optimality of this scheme by comparing it to the upper bound in terms of the gDoF. In noncoherent point-to-point multiple-input-multiple-output (MIMO) channels, where the fading realization is unknown to the transmitter and the receiver, an important tradeoff between communication and channel learning was revealed by Zheng and Tse, by demonstrating that not all the available antennas might be used, as it is suboptimal to learn all their channel parameters. Our results in this paper for the diamond network demonstrate that in certain regimes of relative channel strengths, the gDoF-optimal scheme uses a subnetwork, demonstrating a similar tradeoff between channel learning and communication. In some regimes, it is gDoF-optimal to do relay selection, i.e., use a part of the network. In the other regimes, even when it is essential to use the entire network, it is suboptimal to learn the channel states for all the links in the network, i.e., traditional training-based schemes are suboptimal in these regimes.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n 1\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Joyson Sebastian; and Suhas Diggavi.\n\n\n \n \n \n \n \n On the Generalized Degrees of Freedom of Noncoherent Interference Channel.\n \n \n \n \n\n\n \n\n\n\n arXiv preprint arXiv:1812.03579. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"On arxiv\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{sebastian2018generalized,\n abstract = {We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.},\n author = {Sebastian, Joyson and Diggavi, Suhas},\n journal = {arXiv preprint arXiv:1812.03579},\n tags = {journalSub,IT,ANIT,WiNetnew,NCWN},\n title = {On the Generalized Degrees of Freedom of Noncoherent Interference Channel},\n type = {1},\n url_arxiv = {https://arxiv.org/abs/1812.03579},\n year = {2018}\n}\n\n
\n
\n\n\n
\n We study the generalized degrees of freedom (gDoF) of the block-fading noncoherent 2-user interference channel (IC) with a coherence time of T symbol durations and symmetric fading statistics. We demonstrate that a natural training-based scheme, to operate the noncoherent IC, is suboptimal in several regimes. As an alternate scheme, we propose a new noncoherent rate-splitting scheme. We also consider treating interference-as-noise (TIN) scheme and a time division multiplexing (TDM) scheme. We observe that a standard training-based scheme for IC is outperformed by one of these schemes in several regimes: our results demonstrate that for low average interference-to-noise ratio (INR), TIN is best; for high INR, TDM and the noncoherent rate-splitting give better performance. We also study the noncoherent IC with feedback and propose a noncoherent rate-splitting scheme. Again for the feedback case as well, our results demonstrate that a natural training-based scheme can be outperformed by other schemes.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n J. Sebastian; C. Karakus; and S. Diggavi.\n\n\n \n \n \n \n \n Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT.\n \n \n \n \n\n\n \n\n\n\n IEEE Transactions on Communications, 66(12): 6015-6027. Dec 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Approximate arxiv\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{8429509,\n abstract = {We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen's gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen's gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen's gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen's gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.},\n author = {J. {Sebastian} and C. {Karakus} and S. {Diggavi}},\n doi = {10.1109/TCOMM.2018.2864266},\n issn = {1558-0857},\n journal = {IEEE Transactions on Communications},\n keywords = {approximation theory;channel capacity;diversity reception;fading channels;Gaussian channels;MIMO communication;Nakagami channels;radio transmitters;radiofrequency interference;Rayleigh channels;fast fading interference channels;finite logarithmic Jensen's gap;approximate capacity region;FF-IC;constant capacity gap;instantaneous channel state information;fading distribution;common fading models;Rayleigh channels;Receivers;Transmitters;Integrated circuit modeling;Interference;Interference channels;fast fading;capacity region;rate-splitting},\n month = {Dec},\n number = {12},\n pages = {6015-6027},\n tags = {journal,ANIT,WiNetnew,NCWN,WNIF},\n title = {Approximate Capacity of Fast Fading Interference Channels With no Instantaneous CSIT},\n type = {2},\n url_arxiv = {https://arxiv.org/abs/1706.03659},\n volume = {66},\n year = {2018}\n}\n\n
\n
\n\n\n
\n We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, an approximate capacity region can be obtained for fast fading interference channels (FF-ICs) for several scenarios. We illustrate three instances where a constant capacity gap can be obtained as a function of the logarithmic Jensen's gap. First, for an FF-IC with neither feedback nor instantaneous channel state information at transmitter (CSIT), if the fading distribution has finite logarithmic Jensen's gap, we show that a rate-splitting scheme based on the average interference-to-noise ratio can achieve its approximate capacity. Second, we show that a similar scheme can achieve the approximate capacity of FF-IC with feedback and delayed CSIT, if the fading distribution has finite logarithmic Jensen's gap. Third, when this condition holds, we show that point-to-point codes can achieve approximate capacity for a class of FF-ICs with feedback. We prove that the logarithmic Jensen's gap is finite for common fading models, including Rayleigh and Nakagami fading, thereby obtaining the approximate capacity region of FF-IC with these fading models.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n J. Sebastian; A. Sengupta; and S. N. Diggavi.\n\n\n \n \n \n \n On Capacity of Noncoherent MIMO with Asymmetric Link Strengths.\n \n \n \n\n\n \n\n\n\n In 2017 IEEE International Symposium on Information Theory (ISIT), June 2017. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Joyson_isit17,\n author = {Sebastian, J. and Sengupta, A. and Diggavi, S. N.},\n booktitle = {2017 IEEE International Symposium on Information Theory (ISIT)},\n file = {:papers:isit17_noncoherent.pdf},\n month = {June},\n tags = {conf,WiIntMgmt,IT,WiNet,Noncoherent},\n title = {On Capacity of Noncoherent MIMO with Asymmetric Link Strengths},\n type = {4},\n year = {2017}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n J. Sebastian; C. Karakus; and S. N. Diggavi.\n\n\n \n \n \n \n Approximately achieving the feedback interference channel capacity with point-to-point codes.\n \n \n \n\n\n \n\n\n\n In 2016 IEEE International Symposium on Information Theory (ISIT), pages 715-719, July 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Joyson_AF_isit,\n author = {Sebastian, J. and Karakus, C. and Diggavi, S. N.},\n booktitle = {2016 IEEE International Symposium on Information Theory (ISIT)},\n file = {:papers:isit16_ic_p2p.pdf},\n month = {July},\n pages = {715-719},\n tags = {conf,WiIntMgmt,IT,WiNet,Noncoherent},\n title = {Approximately achieving the feedback interference channel capacity with point-to-point codes},\n type = {4},\n year = {2016}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);